On Some Properties of Non-traceable Cubic Bridge Graph

Graphs considered in this paper are simple finite undirected graphs without loops or multiple edges. A where each vertex has degree 3 is called cubic graphs. graphs, that is, 1-connected bridge graph traceable if its contains Hamiltonian path otherwise, non-traceable. In paper, we introduce a new family of Non-Traceable Cubic Bridge Graph (NTCBG) satisfy the conjecture Zoeram and Yaqubi (2017). addition, defined two important connected component NTCBG central fragment give assurance for to be non-traceable branches. Some properties such as chromatic number clique were also provided.